Hard and soft equilibria in boolean games
نویسندگان
چکیده
A fundamental problem in game theory is the possibility of reaching equilibrium outcomes with undesirable properties, e.g., inefficiency. The economics literature abounds with models that attempt to modify games in order to eliminate such undesirable equilibria, for example through the use of subsidies and taxation, or by allowing players to undergo a preplay negotiation phase. In this paper, we consider the effect of such transformations in Boolean games with costs, where players are primarily motivated to seek the satisfaction of some goal, and are secondarily motivated to minimise the costs of their actions. The preference structure of these games allows us to distinguish between hard and soft equilibria, where hard equilibria arise from goal-seeking behaviour, and cannot be eliminated from games by, e.g., taxes or subsidies, while soft equilibria are those that arise from the desire of agents to minimise costs. We investigate several mechanisms which allow groups of players to form coalitions and eliminate undesirable equilibria from the game, even when taxes or subsidies are not a possibility.
منابع مشابه
Towards tractable Boolean games
Boolean games are a compact and expressive class of games, based on propositional logic. However, Boolean games are computationally complex: checking for the existence of pure Nash equilibria in Boolean games is Σp2-complete, and it is co-NP-complete to check whether a given outcome for a Boolean game is a pure Nash equilibrium. In this paper, we consider two possible avenues to tractability in...
متن کامل∃GUARANTEENASH for Boolean Games is NEXP-Hard
Boolean games are an expressive and natural formalism through which to investigate problems of strategic interaction in multiagent systems. Although they have been widely studied, almost all previous work on Nash equilibria in Boolean games has focused on the restricted setting of pure strategies. This is a shortcoming as finite games are guaranteed to have at least one equilibrium in mixed str...
متن کاملEGuaranteeNash for Boolean Games Is NEXP-Hard
Boolean games are an expressive and natural formalism through which to investigate problems of strategic interaction in multiagent systems. Although they have been widely studied, almost all previous work on Nash equilibria in Boolean games has focused on the restricted setting of pure strategies. This is a shortcoming as finite games are guaranteed to have at least one equilibrium in mixed str...
متن کاملFilter theory in MTL-algebras based on Uni-soft property
The notion of (Boolean) uni-soft filters in MTL-algebras is introduced, and several properties of them are investigated. Characterizations of (Boolean) uni-soft filters are discussed, and some (necessary and sufficient) conditions for a uni-soft filter to be Boolean are provided. The condensational property for a Boolean uni-soft filter is established.
متن کاملComplexity of mixed equilibria in Boolean games
Boolean games are a succinct representation of strategic games wherein a player seeks to satisfy a formula of propositional logic by selecting a truth assignment to a set of propositional variables under his control. The difficulty arises because a player does not necessarily control every variable on which his formula depends, hence the satisfaction of his formula will depend on the assignment...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014